A double ambiguity has been charged against Rawls’s difference principle (DP). Is it Maximin, Leximin, or something else? Usually, following A. Sen, scholars identify DP with the so-called Leximin. One argues here that one has to distinguish 1° the Leximin, 2° the Maximin (as rule of justice formally analogous to the maximin rule of decision), represented by the figure in L of the perfectly substitutable goods, and 3° the genuine DP. When the augmentation of inequality benefits the worse off, only Pareto-strong improvements are permitted. Leximin would also permit Pareto-weak improvements too (after the first maximum D), where only the richest improves: from (2, 3) to (2, 5), say. This is forbidden by DP. With two classes, unlike Maximin, DP has no curve of indifference and is always decisive, as Leximin is. For undecisive Rules of Justice, which admit indifferent curves, I propose to add a lexically secondary rule, to break ties. That move is able to clarify the links and the differences between on the one hand Maximin alone, with its typical indifference curves in L, and on the other hand, the DP properly understood and the Leximin, which both have no indifferent curves. With two classes of persons (best off/worse off), DP appears more egalitarian than Leximin, because it's secondary rule is MinIn (Minimization of Inequality). But the intuition behind the distinction is that it cannot possible “fair” that only the best off improves in a productive social cooperation.

لطفا برای مشاهده چکیده به متن کامل (PDF) مراجعه فرمایید.

Non-cooperative intelligent control agents (ICAs) with dedicated cost functions, can lead the system to poor performance and in some cases, closed-loop instability. A robust solution to this challenge is to place the ICAs at the feedback Nash equilibrium point (FNEP) of the differential game between them. This paper introduces the designation of a robust decentralized infinite horizon LQR control system based on the FNEP for a linear time-invariant system. For this purpose, two control strategies are defined. The first one is a centralized infinite horizon LQR (CIHLQR) problem (i.e. a supervisory problem), and the second one is a decentralized control problem (i.e. an infinite horizon linear-quadratic differential game). Then, while examining the optimal solution of each of the above strategies on the performance of the other, the necessary and sufficient conditions for the equivalence of the two problems are presented. In the absence of the conditions, by using the least-squares error criterion, an approximated CIHLQR controller is presented. It is shown that the theorems could be extended from a two-agent control system to a multi-agent system. Finally, the results are evaluated using the simulation results of a Two-Area non-reheat power system.

این پژوهش به هدف ترسیم دیدگاه قرآن کریم در خصوص جایگاه تعدد زوجات در جامعه ی فعلی دنبال گشته و داده ها از قرآن کریم، تفاسیر و کتاب های صاحب نظران علوم دینی گردآوری گشته و از روش توصیفی تحلیلی استفاده شده است. موضوع تعدد زوجات همواره در اندیشه ی صاحبنظران، از دیدگاه های متفاوت و یا ضد و نقیض برخوردار بوده است. این پژوهش با بررسی مستند قرآنی تعدد زوجات، در پرتو اصل اخلاقی حقوقی معاشرت به معروف، دیدگاه های مربوط به استحباب، منع مطلق، منع حاکم در غیر اضطرار فردی و نیز جوازی که اصل را بر تعدد زوجات شمرده، با اصل مزبور همخوان نمی یابد؛ بلکه الگوی مستفاد از آموزه های قرآن کریم را بر جوازی می یابد که اصل را بر تک همسری می داند و تعدد زوجات در جامعه ی معاصر را در غیر ضرورت های فردی و اجتماعی که نارضایتی همسر اول را به دنبال دارد، مصداقی از سوء معاشرت می خواند؛ زیرا رنجش زن از ازدواج مجدد همسر خود در جامعه ی فعلی، واقعیتی انکارناپذیر است و لزوم رفتار شایسته با همسر و حفظ حرمت وی، هرگز به مرد اجازه نمی دهد که با ازدواج مجدد در غیر ضرورت های فردی و اجتماعی، رنجش همسرش را موجب گردد. به علاوه آن که توجه به سیاق آیه ی مربوطه مبنی بر محدود نمودن تعدد زوجات بی حد و اندازه اعراب عصر نزول وحی به چهار زن و نیز شرط عدالت ورزی در آن، مدلول روشنی بر این واقعیت است.

The Artificial Bee Colony (ABC) Algorithm is a sophisticated optimization technique that is inspired by the intelligent behaviors of honey bee swarms. These behaviors, such as foraging and communication within complex social structures, serve as the foundation for the algorithm's effectiveness. In this paper, the ABC algorithm is utilized to optimize the design of reinforced cantilever concrete retaining walls, with the goal of minimizing both cost and weight. The results are compared to existing literature, demonstrating the success of the ABC algorithm in achieving the objectives. Furthermore, a comparison is conducted between the optimized design and a conventional manual design, revealing a significant reduction in cost and weight through optimization. Additionally, two types of reinforced concrete cantilever retaining walls-a T-shape wall with variable stem thickness and a standard T-shape wall-are presented and compared, considering their differing variables and constraints. These comparisons are made for two objective functions: the cost and weight of the wall. To further investigate the impact of initial parameters, such as the unit weight of soil and stem height, a sensitivity analysis is conducted. The robustness of the ABC algorithm in optimizing the cost and weight of reinforced concrete cantilever retaining walls is demonstrated by the results.

One of the obvious reasons for most disorders in network service provisioning is network path congestion. Congestion avoidance in today's networks is too costly and sometimes impossible. With the introduction of SDN, centralizing the equipment's control plane has become possible. This paper presents an enhanced method named ESV-DBRA to avoid congestion in multi-tenant SDN networks. At first, ESV-DBRA monitors the traffic load and delay of all network paths for each tenant individually. Then, by merging the parameters obtained from the monitoring, the Service Level Agreements (SLA), and a novel proposed cost function, it calculates the cost of the network paths per tenant. As a result, traffic for each tenant is routed through the path/paths at the lowest possible cost from the tenant's perspective. Next, the bandwidth quotas will be calculated and assigned to the tenants over their optimal routes. Afterward, whenever congestion is likely to occur in a path, ESV-DBRA automatically changes the route or bandwidth of the tenants' traffic related to this path to avoid congestion. Related algorithms are also proposed.Eventually, simulations show that the proposed method effectively increases bandwidth utilization by 10.76%.